Time Dependent Traveling Salesman Problem with Time Windows: Properties and an Exact Algorithm
نویسندگان
چکیده
In this paper, we deal with the Time-Dependent Traveling Salesman Problem with Time Windows (TDTSPTW ). Firstly, we prove that under special conditions the TDTSPTW can be solved as an Asymmetric Traveling Salesman Problem with Time Windows (ATSPTW ), with suitable-defined time windows and (constant) travel times. Secondly, we show that, if the special conditions do not hold, the ATSPTW optimal solution provides both a lower bound and (eventually) an upper bound with a worst-case guarantee for the original TDTSPTW . Finally an integer linear programming model is presented and valid inequalities are embedded into a branch-and-cut algorithm. Computational results show that the proposed algorithm is able to solve instances with up to 40 vertices.
منابع مشابه
A New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملAn integer programming approach for the time-dependent traveling salesman problem with time windows
Congestion in large cities and populated areas is one of the major challenges in urban logistics, and should be addressed at different planning and operational levels. The Time Dependent Travelling Salesman Problem (TDTSP) is a generalization of the well known Traveling Salesman Problem (TSP) where the travel times are not assumed to be constant along the day. The motivation to consider the tim...
متن کاملA reactive bone route algorithm for solving the traveling salesman problem
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
متن کامل